Irreducible graphs
نویسندگان
چکیده
منابع مشابه
Irreducible Graphs
A connected graph on three or more vertices is said to be irreducible if it has no leaves, and if each vertex has a unique neighbor set. A connected graph on one or two vertices is also said to be irreducible, and a disconnected graph is irreducible if each of its connected components is irreducible. In this paper, we study the class of irreducible graphs. In particular, we consider an algorith...
متن کاملMaking Bipartite Graphs DM-irreducible
The Dulmage–Mendelsohn decomposition (or the DM-decomposition) gives a unique partition of the vertex set of a bipartite graph reflecting the structure of all the maximum matchings therein. A bipartite graph is said to be DM-irreducible if its DM-decomposition consists of a single component. For connected bipartite graphs, this is equivalent to the condition that every edge is contained in some...
متن کاملAdjacency Graphs, Irreducible Polynomials and Cyclotomy
We consider the adjacency graphs of linear feedback shift registers (LFSRs) with reducible characteristic polynomials. Let l(x) be a characteristic polynomial, and l(x) = l1(x)l2(x) · · · lr(x) be a decomposition of l(x) into co-prime factors. Firstly, we show a connection between the adjacency graph of FSR(l(x)) and the association graphs of FSR(li(x)), 1 ≤ i ≤ r. By this connection, the probl...
متن کاملCounting unlabelled three-connected and homeomorphically irreducible two-connected graphs
A graph will be assumed to be finite and unoriented, with no loops or multiple edges; if multiple edges are to be allowed, the term multigraph will be used. A graph or multigraph. will be called k-connected if at least k vertices and their incident edges must be removed to disconnect it (a complete graph is considered to be k-connected for any k). A block (respectively, multiblock) is a 2-conne...
متن کاملCompiling business processes: untangling unstructured loops in irreducible flow graphs
This paper presents a systematic study of some major problems involved in the transformation of business process modelling languages to executable business process representations. A business process modelling language usually uses the simple concept of ‘goto’ to describe the operation sequence of a business. If a structured language is chosen as the executable representation, it is difficult t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the American Mathematical Society
سال: 1964
ISSN: 0002-9904
DOI: 10.1090/s0002-9904-1964-11115-0